#include<iostream>
const int N = 1e6 + 10;

//#include<iostream>
//#include<unordered_map>
//const int N = 1e6 + 10;
//int a[N];
//using namespace std;
//int main()
//{
//	int n, m;cin >> n >> m;
//	for (int i = 1; i <= n; i++)
//	{
//		cin >> a[i];
//	}
//	int sum = 1e7,ans,ret;
//	for (int i = 1; i <= n - m; i++)
//	{
//		int left = i,right = left; unordered_map <int, int> mp;
//		while (mp.size() != m or right == n)
//		{
//			mp[right] = 1;
//			right++;
//		}
//		if (mp.size() == m and right - left + 1 < sum)
//		{
//			ret = left;
//			ans = right;
//		}
//		sum = right - left + 1;
//	}
//	cout << ret <<  " " << ans;
//	return 0;
////#include<map>
////#include<set>
////#include<iostream>
////#include<unordered_map>
////using namespace std;
////int main()
////{
////	map<int,int> mp;
////	set<int> ml;
////	int a[] = { 1,3,3 };
////	for (int i = 1; i <= 3; i++)
////	{
////		ml.insert(a[i]);
////		mp[i] = a[i];
////	}
////	for (auto v : mp)
////	{
////		cout << v.first << ' ';
////	}
////	cout << endl;
////	cout << mp.size() << endl;
////	cout << ml.size() << endl;
////
////	return 0;
////}